Remarks on Frankl's conjecture
نویسندگان
چکیده
First a few reformulations of Frankl’s conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to attack than Frankl’s. To this end we prove an inequality which might help in proving the stronger conjecture.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملFrankl's Conjecture for Subgroup Lattices
We show that the subgroup lattice of any finite group satisfies Frankl’s UnionClosed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common technical result used to prove both may be of some independent interest.
متن کاملThe 11-element case of Frankl's conjecture
In 1979, P. Frankl conjectured that in a finite union-closed family F of finite sets, F 6= {∅}, there has to be an element that belongs to at least half of the sets in F . We prove this when | ⋃
متن کاملFC-families and improved bounds for Frankl's conjecture
A family of sets A is said to be union-closed if {A∪B : A, B ∈ A} ⊂ A. Frankl’s conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the sets. Here we prove that the conjecture holds for families containing three 3-subsets of a 5-set, four 3-subsets of a 6-set, or eight 4-subsets of a 6-set, extending work of P...
متن کاملOn averaging Frankl's conjecture for large union-closed-sets
Let F be a union-closed family of subsets of an m-element set A. Let n = |F| ≥ 2 and for a ∈ A let s(a) denote the number of sets in F that contain a. Frankl’s conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element a ∈ A with n − 2s(a) ≤ 0. Strengthening a result of Gao and Yu [7] we verify the conjecture for the particular case when m ≥ 3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.01215 شماره
صفحات -
تاریخ انتشار 2016